Erratum to "Automation for interactive proof: First prototype" [Inform. and Comput. 204(2006) 1575-1596]
نویسندگان
چکیده
Erratum Erratum to " Automation for interactive proof: First prototype " [Inform.
منابع مشابه
Automation for interactive proof: First prototype
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem provers (ATPs) such as Vampire and SPASS. An ATP is invoked at suitable points in the interactive session, and any proof found is given to the user in a window displaying an Isar proof script. There are numerous difference...
متن کاملPractical Proof Reconstruction for First-order Logic and Set-Theoretical Constructions
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit from the expressiveness of the first tool and the automation of the latter. We present an implementation of proof reconstruction for first-order logic and set-theoretical constructions between the interactive theorem prover Isabelle and the automatic SMT pro...
متن کاملExpressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants
Formal system development needs expressive specification languages, but also calls for highly automated tools. These two goals are not easy to reconcile, especially if one also aims at high assurances for correctness. In this paper, we describe a combination of Isabelle/HOL with a proof-producing SMT (Satisfiability Modulo Theories) solver that contains a SAT engine and a decision procedure for...
متن کاملProof reconstruction for first-order logic and set-theoretical constructions
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit of the expressiveness of the first tool and the automation of the latter. We present an implementation for proof reconstruction for first-order logic and set-theoretical constructions between Isabelle [11] and haRVey [3].
متن کاملVerifying Concurrent Systems with Symbolic Execution
Current techniques for interactively proving temporal properties of concurrent systems translate transition systems into temporal formulas by introducing program counter variables. Proofs are not intuitive, because control flow is not explicitly considered. For sequential programs symbolic execution is a very intuitive, interactive proof strategy. In this paper we will adopt this technique for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 204 شماره
صفحات -
تاریخ انتشار 2006